A fast iteration for uniform approximation

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A uniform approximation method to solve absolute value equation

In this paper, we propose a parametric uniform approximation method to solve NP-hard absolute value equations. For this, we uniformly approximate absolute value in such a way that the nonsmooth absolute value equation can be formulated as a smooth nonlinear equation. By solving the parametric smooth nonlinear equation using Newton method, for a decreasing sequence of parameters, we can get the ...

متن کامل

A method to obtain the best uniform polynomial approximation for the family of rational function

In this article, by using Chebyshev’s polynomials and Chebyshev’s expansion, we obtain the best uniform polynomial approximation out of P2n to a class of rational functions of the form (ax2+c)-1 on any non symmetric interval [d,e]. Using the obtained approximation, we provide the best uniform polynomial approximation to a class of rational functions of the form (ax2+bx+c)-1 for both cases b2-4a...

متن کامل

Implicit iteration approximation for a‎ ‎finite family of asymptotically quasi-pseudocontractive type‎ ‎mappings

In this paper‎, ‎strong convergence theorems of Ishikawa type implicit iteration‎ ‎process with errors for a finite family of asymptotically‎ ‎nonexpansive in the intermediate sense and asymptotically‎ ‎quasi-pseudocontractive type mappings in normed linear spaces are‎ ‎established by using a new analytical method‎, ‎which essentially‎ ‎improve and extend some recent results obtained by Yang‎ ‎...

متن کامل

ALGEBRAIC MULTILEVEL ITERATION METHODS AND THE BEST APPROXIMATION TO 1/x IN THE UNIFORM NORM

In this note, we provide simple convergence analysis for the algebraic multilevel iteration methods [37, 51]. We consider two examples of AMLI methods with different polynomial acceleration. The first one is based on shifted and scaled Chebyshev polynomial and the other on the polynomial of best approximation to x−1 on a finite interval [λmin , λmax ], 0 < λmin < λmax in the ‖ ·‖∞ norm. The con...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applications of Mathematics

سال: 1988

ISSN: 0862-7940,1572-9109

DOI: 10.21136/am.1988.104308